Univariate polynomial factorization over finite fields
Identifieur interne : 002078 ( Main/Exploration ); précédent : 002077; suivant : 002079Univariate polynomial factorization over finite fields
Auteurs : Patrice Naudin [France] ; Claude Quitté [France]Source :
- Theoretical Computer Science [ 0304-3975 ] ; 1998.
Abstract
This paper is a tutorial introduction to univariate polynomial factorization over finite fields. We recall the classical methods that induced most factorization algorithms (Berlekamp's and the Cantor-Zassenhaus ones) and some refinements which can be applied to these methods. Explicit algorithms are presented in a form suitable for almost immediate implementation. We give a detailed description of an efficient implementation of the Cantor-Zassenhaus algorithm used in the release 2 of the Axiom computer algebra system.
Url:
DOI: 10.1016/S0304-3975(97)80001-1
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001793
- to stream Istex, to step Curation: 001695
- to stream Istex, to step Checkpoint: 001582
- to stream Main, to step Merge: 002195
- to stream Main, to step Curation: 002078
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>Univariate polynomial factorization over finite fields</title><author><name sortKey="Naudin, Patrice" sort="Naudin, Patrice" uniqKey="Naudin P" first="Patrice" last="Naudin">Patrice Naudin</name></author><author><name sortKey="Quitte, Claude" sort="Quitte, Claude" uniqKey="Quitte C" first="Claude" last="Quitté">Claude Quitté</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:432BB8EF5CC63D64648BAB7F65CE8142E78A923F</idno><date when="1998" year="1998">1998</date><idno type="doi">10.1016/S0304-3975(97)80001-1</idno><idno type="url">https://api.istex.fr/document/432BB8EF5CC63D64648BAB7F65CE8142E78A923F/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001793</idno><idno type="wicri:Area/Istex/Curation">001695</idno><idno type="wicri:Area/Istex/Checkpoint">001582</idno><idno type="wicri:doubleKey">0304-3975:1998:Naudin P:univariate:polynomial:factorization</idno><idno type="wicri:Area/Main/Merge">002195</idno><idno type="wicri:Area/Main/Curation">002078</idno><idno type="wicri:Area/Main/Exploration">002078</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">Univariate polynomial factorization over finite fields</title><author><name sortKey="Naudin, Patrice" sort="Naudin, Patrice" uniqKey="Naudin P" first="Patrice" last="Naudin">Patrice Naudin</name><affiliation wicri:level="4"><country xml:lang="fr">France</country><wicri:regionArea>Laboratoire de mathématiques, ESA 6086, Groupes de Lie et Géométrie, Université de Poitiers, 40, Avenue du Recteur Pineau, F-86022 Poitiers Cedex</wicri:regionArea><placeName><region type="region" nuts="2">Aquitaine-Limousin-Poitou-Charentes</region><region type="old region" nuts="2">Poitou-Charentes</region><settlement type="city">Poitiers</settlement></placeName><orgName type="university">Université de Poitiers</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Quitte, Claude" sort="Quitte, Claude" uniqKey="Quitte C" first="Claude" last="Quitté">Claude Quitté</name><affiliation wicri:level="4"><country xml:lang="fr">France</country><wicri:regionArea>Laboratoire de mathématiques, ESA 6086, Groupes de Lie et Géométrie, Université de Poitiers, 40, Avenue du Recteur Pineau, F-86022 Poitiers Cedex</wicri:regionArea><placeName><region type="region" nuts="2">Aquitaine-Limousin-Poitou-Charentes</region><region type="old region" nuts="2">Poitou-Charentes</region><settlement type="city">Poitiers</settlement></placeName><orgName type="university">Université de Poitiers</orgName></affiliation></author></analytic><monogr></monogr><series><title level="j">Theoretical Computer Science</title><title level="j" type="abbrev">TCS</title><idno type="ISSN">0304-3975</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1998">1998</date><biblScope unit="volume">191</biblScope><biblScope unit="issue">1–2</biblScope><biblScope unit="page" from="1">1</biblScope><biblScope unit="page" to="36">36</biblScope></imprint><idno type="ISSN">0304-3975</idno></series><idno type="istex">432BB8EF5CC63D64648BAB7F65CE8142E78A923F</idno><idno type="DOI">10.1016/S0304-3975(97)80001-1</idno><idno type="PII">S0304-3975(97)80001-1</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0304-3975</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">This paper is a tutorial introduction to univariate polynomial factorization over finite fields. We recall the classical methods that induced most factorization algorithms (Berlekamp's and the Cantor-Zassenhaus ones) and some refinements which can be applied to these methods. Explicit algorithms are presented in a form suitable for almost immediate implementation. We give a detailed description of an efficient implementation of the Cantor-Zassenhaus algorithm used in the release 2 of the Axiom computer algebra system.</div></front></TEI><affiliations><list><country><li>France</li></country><region><li>Aquitaine-Limousin-Poitou-Charentes</li><li>Poitou-Charentes</li></region><settlement><li>Poitiers</li></settlement><orgName><li>Université de Poitiers</li></orgName></list><tree><country name="France"><region name="Aquitaine-Limousin-Poitou-Charentes"><name sortKey="Naudin, Patrice" sort="Naudin, Patrice" uniqKey="Naudin P" first="Patrice" last="Naudin">Patrice Naudin</name></region><name sortKey="Naudin, Patrice" sort="Naudin, Patrice" uniqKey="Naudin P" first="Patrice" last="Naudin">Patrice Naudin</name><name sortKey="Quitte, Claude" sort="Quitte, Claude" uniqKey="Quitte C" first="Claude" last="Quitté">Claude Quitté</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002078 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002078 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:432BB8EF5CC63D64648BAB7F65CE8142E78A923F
|texte= Univariate polynomial factorization over finite fields
}}
| This area was generated with Dilib version V0.6.32. |  |